home *** CD-ROM | disk | FTP | other *** search
- Path: newsbf02.news.aol.com!not-for-mail
- From: jjones2168@aol.com (JJones2168)
- Newsgroups: comp.lang.c++
- Subject: ----------Need help with Procedure!!!----------
- Date: 8 Apr 1996 20:58:47 -0400
- Organization: America Online, Inc. (1-800-827-6364)
- Sender: root@newsbf02.news.aol.com
- Message-ID: <4kcco7$a5h@newsbf02.news.aol.com>
- Reply-To: jjones2168@aol.com (JJones2168)
- NNTP-Posting-Host: newsbf02.mail.aol.com
-
- Given a structure such as this:
-
- 1
- / \
- 2-----3
- \ /
- 4
-
- How can I find all possible paths from one point to another?
- (I tried using an "adjacency matrix", but I need to be able to support up
- to 200 points, which would require three 200x200 matrices of strings (a
- lot of mem.)
-
- Please reply to JFormby@ix.netcom.com
-